An SMT solver for non-linear real arithmetic inside maple
نویسندگان
چکیده
We report on work-in-progress to create an SMT-solver inside Maple for non-linear real arithmetic (NRA). give background information the algorithm being implemented: cylindrical algebraic coverings as a theory solver in lazy SMT paradigm. then present some new work identification of minimal conflicting cores from coverings.
منابع مشابه
On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver
Off-the-shelf linear programming (LP) solvers trade soundness for speed: for efficiency, the arithmetic is not exact rational arithmetic but floating-point arithmetic. As a side-effect the results come without any formal guarantee and cannot be directly used for deciding linear arithmetic. In this work we explain how to design a sound procedure for linear arithmetic built upon an inexact floati...
متن کاملBeaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifierfree finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, encoding the original SMT problem into a Boolean satisfiability (SAT) problem using a series of word-level and bit-level transformations. In this paper, we describe the most effective transformations, such as propagating ...
متن کاملA Lazy SMT-Solver for a Non-Linear Subset of Real Algebra
There are several methods for the synthesis and analysis of hybrid systems that require efficient algorithms and tool for satisfiability checking. In this paper we give examples of such synthesis and analysis methods, and discuss decision procedures that can be used for this purpose.
متن کاملImplication Graph Compression inside the SMT Solver iSAT3
The iSAT algorithm aims at solving boolean combinations of linear and non-linear arithmetic constraint formulas (including transcendental functions), and thus is suitable to verify safety properties of systems consisting of both, linear and non-linear behaviour. The iSAT algorithm tightly integrates interval constraint propagation into the conflict-driven clauselearning framework. During the so...
متن کاملνZ - An Optimizing SMT Solver
νZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. νZ provides a portfolio of approaches for solving linear optimization problems over SMT formulas, MaxSMT, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2022
ISSN: ['1932-2232', '1932-2240']
DOI: https://doi.org/10.1145/3572867.3572880